/**************************************************************************
***    
*** Copyright (c) 1995-2000 Regents of the University of California,
***               Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov
*** Copyright (c) 2000-2002 Regents of the University of Michigan,
***               Saurabh N. Adya and Igor L. Markov
***
***  Contact author(s): abk@cs.ucsd.edu, imarkov@umich.edu
***  Original Affiliation:   UCLA, Computer Science Department,
***                          Los Angeles, CA 90095-1596 USA
***
***  Permission is hereby granted, free of charge, to any person obtaining 
***  a copy of this software and associated documentation files (the
***  "Software"), to deal in the Software without restriction, including
***  without limitation 
***  the rights to use, copy, modify, merge, publish, distribute, sublicense, 
***  and/or sell copies of the Software, and to permit persons to whom the 
***  Software is furnished to do so, subject to the following conditions:
***
***  The above copyright notice and this permission notice shall be included
***  in all copies or substantial portions of the Software.
***
*** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
*** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
*** OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
*** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
*** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
*** OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
*** THE USE OR OTHER DEALINGS IN THE SOFTWARE.
***
***
***************************************************************************/




// Created by Igor Markov, Sat Jul 21, 2001
// 020811  ilm   ported to g++ 3.0

#include "hgDelayInfo.h"
#include "ABKCommon/abkcommon.h"
#include <iostream>
#include <iomanip>

std::ostream& operator<<(std::ostream& out, const HGDelayInfo& di)
{
    out << endl << " -------- HyperGraph Delay Information : " << endl;
    if (!di.populated)
    {
      out << " Not populated " << endl;
      return out;
    }
    out << " cInt_c: " << di.cInt_c << endl;
    out << " cInt_k: " << di.cInt_k << endl;
    out << " rInt_c: " << di.rInt_c << endl;
    out << " rInt_k: " << di.rInt_k << endl;
    abkfatal(di.drivRes.size()==di.sinkCap.size(),
             "drivRes and sinkCap sizes differ");
    unsigned k=0;
    for(k=0; k!=di.drivRes.size(); k++)
    {
       out << " Pin " << setw(4) << k 
           << " : sink cap= " << setw(10) << di.sinkCap[k] << "    "
           << " : driv res= " << setw(10) << di.drivRes[k] << endl;
    }
    return out;
}
